<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>qLibc: utilities/qhash.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">qLibc
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('qhash_8c_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle"><div class="title">qhash.c</div></div>
</div><!--header-->
<div class="contents">
<a href="qhash_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * qLibc</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Copyright (c) 2010-2015 Seungyoung Kim.</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * All rights reserved.</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> *</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * Redistribution and use in source and binary forms, with or without</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * modification, are permitted provided that the following conditions are met:</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> *</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * 1. Redistributions of source code must retain the above copyright notice,</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> *    this list of conditions and the following disclaimer.</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright notice,</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *    this list of conditions and the following disclaimer in the documentation</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> *    and/or other materials provided with the distribution.</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> *</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot;</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * POSSIBILITY OF SUCH DAMAGE.</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> *****************************************************************************/</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"></span> </div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">/**</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * @file qhash.c Hash APIs.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> */</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;stdio.h&gt;</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;stdlib.h&gt;</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;stdbool.h&gt;</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;string.h&gt;</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;unistd.h&gt;</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;fcntl.h&gt;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;errno.h&gt;</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;sys/types.h&gt;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;sys/stat.h&gt;</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &quot;md5/md5.h&quot;</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &quot;qinternal.h&quot;</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &quot;utilities/qhash.h&quot;</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"></span> </div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">/**</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> * Calculate 128-bit(16-bytes) MD5 hash.</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> *</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> * @param data      source object</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment"> * @param nbytes    size of data</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"> * @param retbuf    user buffer. It must be at leat 16-bytes long.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment"> *</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment"> * @return true if successful, otherwise false.</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment"> *</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment"> *   // get MD5</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment"> *   unsigned char md5hash[16];</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment"> *   qhashmd5((void*)&quot;hello&quot;, 5, md5hash);</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment"> *</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment"> *   // hex encode</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment"> *   char *md5ascii = qhex_encode(md5hash, 16);</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment"> *   printf(&quot;Hex encoded MD5: %s\n&quot;, md5ascii);</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment"> *   free(md5ascii);</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment"> */</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="qhash_8c.html#a3ed9a8cb5f08fa3e3c58776a62f3f54f">   67</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="qhash_8c.html#a3ed9a8cb5f08fa3e3c58776a62f3f54f">qhashmd5</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> nbytes, <span class="keywordtype">void</span> *retbuf) {</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">if</span> (data == NULL || retbuf == NULL) {</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        errno = EINVAL;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    MD5_CTX context;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    MD5Init(&amp;context);</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    MD5Update(&amp;context, (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) data, (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) nbytes);</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    MD5Final(retbuf, &amp;context);</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment"></span> </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment">/**</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment"> * Get 128-bit MD5 hash of a file contents.</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment"> *</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment"> * @param filepath  file path</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment"> * @param offset    start offset. Set to 0 to digest from beginning of file.</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment"> * @param nbytes    number of bytes to digest. Set to 0 to digest until end</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"> *                  of file.</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment"> * @param retbuf    user buffer. It must be at leat 16-bytes long.</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment"> *</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment"> * @return true if successful, otherwise false.</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment"> *</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment"> *   unsigned char md5hash[16];</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment"> *   qhashmd5_file(&quot;/tmp/test.dat&quot;, 0, 0, md5hash);</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment"> */</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="qhash_8c.html#af14399e691041012350c3a82f337970e">   97</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="qhash_8c.html#af14399e691041012350c3a82f337970e">qhashmd5_file</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *filepath, off_t offset, ssize_t nbytes,</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                   <span class="keywordtype">void</span> *retbuf) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">if</span> (filepath == NULL || offset &lt; 0 || nbytes &lt; 0 || retbuf == NULL) {</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        errno = EINVAL;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordtype">int</span> fd = open(filepath, O_RDONLY, 0);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">if</span> (fd &lt; 0)</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keyword">struct </span>stat st;</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">if</span> (fstat(fd, &amp;st) &lt; 0)</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordtype">size_t</span> size = st.st_size;</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// check filesize</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">if</span> (size &lt; offset + nbytes) {</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        errno = EINVAL;</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        close(fd);</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="comment">// if requested to digest until the end of file, set nbytes to the remaining size</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">if</span> (nbytes == 0) {</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        nbytes = size - offset;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="comment">// move the seek pointer to the beginning of the offset</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">if</span> (offset &gt; 0) {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">if</span> (lseek(fd, offset, SEEK_SET) != offset) {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            close(fd);</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        }</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    MD5_CTX context;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    MD5Init(&amp;context);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    ssize_t toread, nread;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> buf[32 * 1024];</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordflow">for</span> (toread = nbytes; toread &gt; 0; toread -= nread) {</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="keywordflow">if</span> (toread &gt; <span class="keyword">sizeof</span>(buf))</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            nread = read(fd, buf, <span class="keyword">sizeof</span>(buf));</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">else</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            nread = read(fd, buf, toread);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="keywordflow">if</span> (nread &lt; 0)</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        MD5Update(&amp;context, buf, nread);</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    close(fd);</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordflow">if</span> (toread != 0)</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    MD5Final(retbuf, &amp;context);</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment"></span> </div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">/**</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="comment"> * Get 32-bit FNV1 hash.</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="comment"> *</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="comment"> * @param data      source data</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment"> * @param nbytes    size of data</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment"> *</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment"> * @return 32-bit unsigned hash value.</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment"> *</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="comment"> *  uint32_t hashval = qhashfnv1_32((void*)&quot;hello&quot;, 5);</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment"> *</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment"> *  Fowler/Noll/Vo hash</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="comment"> *</span></div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="comment"> *  The basis of this hash algorithm was taken from an idea sent as reviewer</span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="comment"> *  comments to the IEEE POSIX P1003.2 committee by:</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment"> *</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment"> *      Phong Vo (http://www.research.att.com/info/kpv/)</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment"> *      Glenn Fowler (http://www.research.att.com/~gsf/)</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment"> *</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span><span class="comment"> *  In a subsequent ballot round:</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="comment"> *</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="comment"> *      Landon Curt Noll (http://www.isthe.com/chongo/)</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="comment"> *</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="comment"> *  improved on their algorithm.  Some people tried this hash and found that</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment"> *  it worked rather well. In an EMail message to Landon, they named it the</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment"> *  ``Fowler/Noll/Vo&#39;&#39; or FNV hash.</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment"> *</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment"> *  FNV hashes are designed to be fast while maintaining a low collision rate.</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment"> *  The FNV speed allows one to quickly hash lots of data while maintaining</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment"> *  a reasonable collision rate.  See:</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment"> *</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment"> *      http://www.isthe.com/chongo/tech/comp/fnv/index.html</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment"> *</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment"> *  for more details as well as other forms of the FNV hash.</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment"> */</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="qhash_8c.html#aef9d067568c8c774a1d455259612a304">  192</a></span>uint32_t <a class="code hl_function" href="qhash_8c.html#aef9d067568c8c774a1d455259612a304">qhashfnv1_32</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> nbytes) {</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="keywordflow">if</span> (data == NULL || nbytes == 0)</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *dp;</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    uint32_t h = 0x811C9DC5;</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="keywordflow">for</span> (dp = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) data; *dp &amp;&amp; nbytes &gt; 0; dp++, nbytes--) {</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="preprocessor">#ifdef __GNUC__</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        h += (h&lt;&lt;1) + (h&lt;&lt;4) + (h&lt;&lt;7) + (h&lt;&lt;8) + (h&lt;&lt;24);</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        h *= 0x01000193;</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        h ^= *dp;</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    }</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="keywordflow">return</span> h;</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="comment"></span> </div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="comment">/**</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="comment"> * Get 64-bit FNV1 hash integer.</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="comment"> *</span></div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="comment"> * @param data      source data</span></div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="comment"> * @param nbytes    size of data</span></div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="comment"> *</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="comment"> * @return 64-bit unsigned hash value.</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="comment"> *</span></div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="comment"> *   uint64_t fnv64 = qhashfnv1_64((void*)&quot;hello&quot;, 5);</span></div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="comment"> */</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"><a class="line" href="qhash_8c.html#a4e5daad0624e2ce2bf8c77da01228e0a">  223</a></span>uint64_t <a class="code hl_function" href="qhash_8c.html#a4e5daad0624e2ce2bf8c77da01228e0a">qhashfnv1_64</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> nbytes) {</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordflow">if</span> (data == NULL || nbytes == 0)</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *dp;</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    uint64_t h = 0xCBF29CE484222325ULL;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="keywordflow">for</span> (dp = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) data; *dp &amp;&amp; nbytes &gt; 0; dp++, nbytes--) {</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="preprocessor">#ifdef __GNUC__</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        h += (h &lt;&lt; 1) + (h &lt;&lt; 4) + (h &lt;&lt; 5) +</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        (h &lt;&lt; 7) + (h &lt;&lt; 8) + (h &lt;&lt; 40);</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        h *= 0x100000001B3ULL;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        h ^= *dp;</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    }</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="keywordflow">return</span> h;</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>}</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment"></span> </div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment">/**</span></div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment"> * Get 32-bit Murmur3 hash.</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment"> *</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment"> * @param data      source data</span></div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment"> * @param nbytes    size of data</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment"> *</span></div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment"> * @return 32-bit unsigned hash value.</span></div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment"> *</span></div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="comment"> *  uint32_t hashval = qhashmurmur3_32((void*)&quot;hello&quot;, 5);</span></div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="comment"> *</span></div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="comment"> *  MurmurHash3 was created by Austin Appleby  in 2008. The initial</span></div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="comment"> *  implementation was published in C++ and placed in the public.</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="comment"> *    https://sites.google.com/site/murmurhash/</span></div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment"> *  Seungyoung Kim has ported its implementation into C language</span></div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment"> *  in 2012 and published it as a part of qLibc component.</span></div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment"> */</span></div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"><a class="line" href="qhash_8c.html#a433dc88e449b346a863f957421c4d2ba">  263</a></span>uint32_t <a class="code hl_function" href="qhash_8c.html#a433dc88e449b346a863f957421c4d2ba">qhashmurmur3_32</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> nbytes) {</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    <span class="keywordflow">if</span> (data == NULL || nbytes == 0)</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    <span class="keyword">const</span> uint32_t c1 = 0xcc9e2d51;</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="keyword">const</span> uint32_t c2 = 0x1b873593;</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> nblocks = nbytes / 4;</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keyword">const</span> uint32_t *blocks = (<span class="keyword">const</span> uint32_t *) (data);</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keyword">const</span> uint8_t *tail = (<span class="keyword">const</span> uint8_t *) (data + (nblocks * 4));</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    uint32_t h = 0;</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordtype">int</span> i;</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    uint32_t k;</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    <span class="keywordflow">for</span> (i = 0; i &lt; nblocks; i++) {</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        k = blocks[i];</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        k *= c1;</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        k = (k &lt;&lt; 15) | (k &gt;&gt; (32 - 15));</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        k *= c2;</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        h ^= k;</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        h = (h &lt;&lt; 13) | (h &gt;&gt; (32 - 13));</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        h = (h * 5) + 0xe6546b64;</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    }</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    k = 0;</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    <span class="keywordflow">switch</span> (nbytes &amp; 3) {</div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        <span class="keywordflow">case</span> 3:</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            k ^= tail[2] &lt;&lt; 16;</div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>            k ^= tail[1] &lt;&lt; 8;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>            k ^= tail[0];</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>            k *= c1;</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>            k = (k &lt;&lt; 15) | (k &gt;&gt; (32 - 15));</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>            k *= c2;</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>            h ^= k;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    };</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span> </div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    h ^= nbytes;</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    h ^= h &gt;&gt; 16;</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    h *= 0x85ebca6b;</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    h ^= h &gt;&gt; 13;</div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    h *= 0xc2b2ae35;</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    h ^= h &gt;&gt; 16;</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <span class="keywordflow">return</span> h;</div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>}</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span><span class="comment"></span> </div>
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span><span class="comment">/**</span></div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span><span class="comment"> * Get 128-bit Murmur3 hash.</span></div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="comment"> *</span></div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="comment"> * @param data      source data</span></div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="comment"> * @param nbytes    size of data</span></div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="comment"> * @param retbuf    user buffer. It must be at leat 16-bytes long.</span></div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span><span class="comment"> *</span></div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span><span class="comment"> * @return true if successful, otherwise false.</span></div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span><span class="comment"> *</span></div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span><span class="comment"> * @code</span></div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span><span class="comment"> *   // get 128-bit Murmur3 hash.</span></div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="comment"> *   unsigned char hash[16];</span></div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="comment"> *   qhashmurmur3_128((void*)&quot;hello&quot;, 5, hash);</span></div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="comment"> *</span></div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="comment"> *   // hex encode</span></div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="comment"> *   char *ascii = qhex_encode(hash, 16);</span></div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="comment"> *   printf(&quot;Hex encoded Murmur3: %s\n&quot;, ascii);</span></div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="comment"> *   free(ascii);</span></div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="comment"> * @endcode</span></div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span><span class="comment"> */</span></div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"><a class="line" href="qhash_8c.html#ac130b57203ec6f04fd0faa097bf14b6b">  335</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="qhash_8c.html#ac130b57203ec6f04fd0faa097bf14b6b">qhashmurmur3_128</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *data, <span class="keywordtype">size_t</span> nbytes, <span class="keywordtype">void</span> *retbuf) {</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">if</span> (data == NULL || nbytes == 0)</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <span class="keyword">const</span> uint64_t c1 = 0x87c37b91114253d5ULL;</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    <span class="keyword">const</span> uint64_t c2 = 0x4cf5ad432745937fULL;</div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span> </div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> nblocks = nbytes / 16;</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    <span class="keyword">const</span> uint64_t *blocks = (<span class="keyword">const</span> uint64_t *) (data);</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    <span class="keyword">const</span> uint8_t *tail = (<span class="keyword">const</span> uint8_t *) (data + (nblocks * 16));</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    uint64_t h1 = 0;</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>    uint64_t h2 = 0;</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    <span class="keywordtype">int</span> i;</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    uint64_t k1, k2;</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="keywordflow">for</span> (i = 0; i &lt; nblocks; i++) {</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>        k1 = blocks[i * 2 + 0];</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>        k2 = blocks[i * 2 + 1];</div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span> </div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>        k1 *= c1;</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>        k1 = (k1 &lt;&lt; 31) | (k1 &gt;&gt; (64 - 31));</div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>        k1 *= c2;</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        h1 ^= k1;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span> </div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>        h1 = (h1 &lt;&lt; 27) | (h1 &gt;&gt; (64 - 27));</div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>        h1 += h2;</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        h1 = h1 * 5 + 0x52dce729;</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span> </div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>        k2 *= c2;</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>        k2 = (k2 &lt;&lt; 33) | (k2 &gt;&gt; (64 - 33));</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        k2 *= c1;</div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>        h2 ^= k2;</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span> </div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>        h2 = (h2 &lt;&lt; 31) | (h2 &gt;&gt; (64 - 31));</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>        h2 += h1;</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>        h2 = h2 * 5 + 0x38495ab5;</div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    }</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span> </div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    k1 = k2 = 0;</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <span class="keywordflow">switch</span> (nbytes &amp; 15) {</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>        <span class="keywordflow">case</span> 15:</div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>            k2 ^= (uint64_t)(tail[14]) &lt;&lt; 48;</div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>        <span class="keywordflow">case</span> 14:</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>            k2 ^= (uint64_t)(tail[13]) &lt;&lt; 40;</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        <span class="keywordflow">case</span> 13:</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>            k2 ^= (uint64_t)(tail[12]) &lt;&lt; 32;</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        <span class="keywordflow">case</span> 12:</div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>            k2 ^= (uint64_t)(tail[11]) &lt;&lt; 24;</div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>        <span class="keywordflow">case</span> 11:</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>            k2 ^= (uint64_t)(tail[10]) &lt;&lt; 16;</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <span class="keywordflow">case</span> 10:</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>            k2 ^= (uint64_t)(tail[9]) &lt;&lt; 8;</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <span class="keywordflow">case</span> 9:</div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>            k2 ^= (uint64_t)(tail[8]) &lt;&lt; 0;</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>            k2 *= c2;</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            k2 = (k2 &lt;&lt; 33) | (k2 &gt;&gt; (64 - 33));</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>            k2 *= c1;</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>            h2 ^= k2;</div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>        <span class="keywordflow">case</span> 8:</div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>            k1 ^= (uint64_t)(tail[7]) &lt;&lt; 56;</div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        <span class="keywordflow">case</span> 7:</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>            k1 ^= (uint64_t)(tail[6]) &lt;&lt; 48;</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>        <span class="keywordflow">case</span> 6:</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>            k1 ^= (uint64_t)(tail[5]) &lt;&lt; 40;</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>        <span class="keywordflow">case</span> 5:</div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>            k1 ^= (uint64_t)(tail[4]) &lt;&lt; 32;</div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>        <span class="keywordflow">case</span> 4:</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>            k1 ^= (uint64_t)(tail[3]) &lt;&lt; 24;</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        <span class="keywordflow">case</span> 3:</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>            k1 ^= (uint64_t)(tail[2]) &lt;&lt; 16;</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>        <span class="keywordflow">case</span> 2:</div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>            k1 ^= (uint64_t)(tail[1]) &lt;&lt; 8;</div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        <span class="keywordflow">case</span> 1:</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>            k1 ^= (uint64_t)(tail[0]) &lt;&lt; 0;</div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>            k1 *= c1;</div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>            k1 = (k1 &lt;&lt; 31) | (k1 &gt;&gt; (64 - 31));</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>            k1 *= c2;</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>            h1 ^= k1;</div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    };</div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span> </div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    <span class="comment">//----------</span></div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    <span class="comment">// finalization</span></div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span> </div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    h1 ^= nbytes;</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    h2 ^= nbytes;</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span> </div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>    h1 += h2;</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    h2 += h1;</div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    h1 ^= h1 &gt;&gt; 33;</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    h1 *= 0xff51afd7ed558ccdULL;</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    h1 ^= h1 &gt;&gt; 33;</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    h1 *= 0xc4ceb9fe1a85ec53ULL;</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    h1 ^= h1 &gt;&gt; 33;</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span> </div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    h2 ^= h2 &gt;&gt; 33;</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    h2 *= 0xff51afd7ed558ccdULL;</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    h2 ^= h2 &gt;&gt; 33;</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    h2 *= 0xc4ceb9fe1a85ec53ULL;</div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    h2 ^= h2 &gt;&gt; 33;</div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    h1 += h2;</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    h2 += h1;</div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span> </div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    ((uint64_t *) retbuf)[0] = h1;</div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    ((uint64_t *) retbuf)[1] = h2;</div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>}</div>
<div class="ttc" id="aqhash_8c_html_a3ed9a8cb5f08fa3e3c58776a62f3f54f"><div class="ttname"><a href="qhash_8c.html#a3ed9a8cb5f08fa3e3c58776a62f3f54f">qhashmd5</a></div><div class="ttdeci">bool qhashmd5(const void *data, size_t nbytes, void *retbuf)</div><div class="ttdoc">Calculate 128-bit(16-bytes) MD5 hash.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00067">qhash.c:67</a></div></div>
<div class="ttc" id="aqhash_8c_html_a433dc88e449b346a863f957421c4d2ba"><div class="ttname"><a href="qhash_8c.html#a433dc88e449b346a863f957421c4d2ba">qhashmurmur3_32</a></div><div class="ttdeci">uint32_t qhashmurmur3_32(const void *data, size_t nbytes)</div><div class="ttdoc">Get 32-bit Murmur3 hash.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00263">qhash.c:263</a></div></div>
<div class="ttc" id="aqhash_8c_html_a4e5daad0624e2ce2bf8c77da01228e0a"><div class="ttname"><a href="qhash_8c.html#a4e5daad0624e2ce2bf8c77da01228e0a">qhashfnv1_64</a></div><div class="ttdeci">uint64_t qhashfnv1_64(const void *data, size_t nbytes)</div><div class="ttdoc">Get 64-bit FNV1 hash integer.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00223">qhash.c:223</a></div></div>
<div class="ttc" id="aqhash_8c_html_ac130b57203ec6f04fd0faa097bf14b6b"><div class="ttname"><a href="qhash_8c.html#ac130b57203ec6f04fd0faa097bf14b6b">qhashmurmur3_128</a></div><div class="ttdeci">bool qhashmurmur3_128(const void *data, size_t nbytes, void *retbuf)</div><div class="ttdoc">Get 128-bit Murmur3 hash.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00335">qhash.c:335</a></div></div>
<div class="ttc" id="aqhash_8c_html_aef9d067568c8c774a1d455259612a304"><div class="ttname"><a href="qhash_8c.html#aef9d067568c8c774a1d455259612a304">qhashfnv1_32</a></div><div class="ttdeci">uint32_t qhashfnv1_32(const void *data, size_t nbytes)</div><div class="ttdoc">Get 32-bit FNV1 hash.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00192">qhash.c:192</a></div></div>
<div class="ttc" id="aqhash_8c_html_af14399e691041012350c3a82f337970e"><div class="ttname"><a href="qhash_8c.html#af14399e691041012350c3a82f337970e">qhashmd5_file</a></div><div class="ttdeci">bool qhashmd5_file(const char *filepath, off_t offset, ssize_t nbytes, void *retbuf)</div><div class="ttdoc">Get 128-bit MD5 hash of a file contents.</div><div class="ttdef"><b>Definition</b> <a href="qhash_8c_source.html#l00097">qhash.c:97</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_7b5d38f1875f1b693f62ca6a108a1129.html">utilities</a></li><li class="navelem"><a class="el" href="qhash_8c.html">qhash.c</a></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
  </ul>
</div>
</body>
</html>
